LATTICE PATHS RESTRICTED BY TWO PARALLEL HYPERPLANES
نویسندگان
چکیده
منابع مشابه
Separating Points by Parallel Hyperplanes - Characterization Problem
This paper deals with partitions of a discrete set S of points in a d-dimensional space, by h parallel hyperplanes. Such partitions are in a direct correspondence with multilinear threshold functions which appear in the theory of neural networks and multivalued logic. The characterization (encoding) problem is studied. We show that a unique characterization (encoding) of such multilinear partit...
متن کاملHigher dimensional restricted lattice paths with diagonal steps
Kaparthi, S. and H.R. Rao, Higher dimensional restricted lattice paths with diagonal steps, Discrete Applied Mathematics 31(1991) 279-289. In this paper, restricted minimal lattice paths with horizontal, vertical, and diagonal steps, in two and higher dimensions are discussed. The Delannoy numbers, the numbers of unrestricted minimal lattice paths with diagonal steps, and some of their properti...
متن کاملTwo-boundary lattice paths and parking functions
We describe an involution on a set of sequences associated with lattice paths with north or east steps constrained to lie between two arbitrary boundaries. This involution yields recursions (from which determinantal formulas can be derived) for the number and area enumerator of such paths. An analogous involution can be defined for parking functions with arbitrary lower and upper bounds. From t...
متن کاملBijections for lattice paths between two boundaries
We prove that on the set of lattice paths with steps N = (0, 1) and E = (1, 0) that lie between two boundaries B and T , the two statistics ‘number of E steps shared with B’ and ‘number of E steps shared with T ’ have a symmetric joint distribution. We give an involution that switches these statistics, preserves additional parameters, and generalizes to paths that contain steps S = (0,−1) at pr...
متن کاملTwo New Bijections on Lattice Paths
Suppose 2n voters vote sequentially for one of two candidates. For how many such sequences does one candidate have strictly more votes than the other at each stage of the voting? The answer is (2n n ) and, while easy enough to prove using generating functions, for example, only two combinatorial proofs exist, due to Kleitman and Gessel. In this paper we present two new (far simpler) bijective p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of informatics and cybernetics
سال: 1985
ISSN: 0286-522X
DOI: 10.5109/13371